decoding complexity meaning in Chinese
译码复杂性
Examples
- Designing codes with approaching shannon ' s capacity performance and low coding and decoding complexity is a challenging and meaningful issue in channel coding field
设计性能逼近信道容量、编译码复杂度较低的实用好码是信道编码领域中最重要的工作之一。 - Turbo code was introduced by c . berrou in 1993 . turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity , provided that the code words are long enough
1993年, c . berrou提出了一种新的信道编码方案? ? turbo码, turbo码能够在编码长度较长的情况下得到接近香农极限的纠错性能。 - Its decoding complexity is also lower than turbo code . recently , ldpc code has drawn the worldwide attentions in channel coding community due to its high performance and strong potential applications in practice
Ldpc码的数学定义非常简单,具有较大的灵活性,当码长足够长时的非正规ldpc码具有比turbo码更为良好的性能,其译码复杂度低于turbo码。 - Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes . with advantages of high encoding gain , low decoding complexity and flexible code rates , etc . , the research of these codes has become a hot spot of coding academia
低密度校验码( ldpc )性能接近香农限,具有编码增益高、译码简单快捷、码率灵活等优点,是当前编码界的研究热点。 - 3 . by theoretical analysis and simulation , quantization decoding of ldpc codes is studied . an efficient quantization - decoding scheme is proposed which can greatly reduce the decoding complexity with a little performance loss
采用理论分析和仿真相结合的方法研究了ldpc码的量化译码，提出了一种高效的量化译码实现方案，该方案能够大大降低译码复杂度，同时译码性能非常接近连续译码。